Some sufficient conditions for infinite collisions of simple random walks on a wedge comb
نویسندگان
چکیده
In this paper, we give some sufficient conditions for the infinite collisions of independent simple random walks on a wedge comb with profile {f(n), n ∈ Z}. One interesting result is that two independent simple random walks on the wedge comb will collide infinitely many times if f(n) has a growth order as n log n. On the other hand, if {f(n);n ∈ Z} are given by i.i.d. non-negative random variables with finite mean, then for almost all wedge combs with such profile, three independent simple random walks on it will collide infinitely many times. MSC 2010 subject classification: 60J10, 60K37.
منابع مشابه
Infinite Excursions of Router Walks on Regular Trees
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a deterministic process: at each step it chooses the next unused rotor in its current location, and uses it to jump to the neighboring vertex to which it points. Rotor...
متن کاملRecurrent graphs where two independent random walks collide finitely
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z 2 by removing all horizontal edges off the x-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation ...
متن کاملRecurrent graphs where two independent random walks collide finitely often Manjunath Krishnapur and Yuval Peres
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z 2 by removing all horizontal edges off the x-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation ...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011